Parallelizing Imperative Functional Programs: the Vectorization Monad

Parallelizing Imperative Functional Programs: the Vectorization Monad

Traditionally a vectorizing compiler matches the iterative constructs of a program against a set of predefined templates. If a loop contains no dependency cycles then a map template can be used; other simple dependencies can often be expressed in terms of fold or scan templates. This paper addresses the template matching problem within the context of functional programming. A small collection o...

Interprocedural Heap Analysis for Parallelizing Imperative Programs

Parallelizing Functional Programs by Generalization

List homomorphisms are functions that are parallelizable using the divide-and-conquer paradigm. We study the problem of nding a homomorphic representation of a given function, based on the Bird-Meertens theory of lists. A previous work proved that to each pair of leftward and rightward sequential representations of a function, based on cons-and snoc-lists, respectively, there is also a represen...

A Monad of Imperative Streams

A new approach is presented for performing concurrent I/O in a functional programming language. A new monad St is introduced which generalizes Haskell's IO monad: A value of type St a represents an imperative program which, at certain times during its execution, will produce a value of type a. In contrast, a value of type IO a represents an imperative program which, at the end of its execution,...

Parallelizing Functional Programs by Term Rewriting

List homomorphisms are functions that can be computed in parallel using the divide-and-conquer paradigm. We study the problem of nding a homomorphic representation of a given function, based on the Bird-Meertens theory of lists. A previous work proved that to each pair of leftward and rightward sequential representations of a function, based on cons-and snoc-lists, respectively, there is also a...